Parameterized Verification of Asynchronous Shared-Memory Systems
نویسندگان
چکیده
منابع مشابه
Model Checking Parameterized Asynchronous Shared-Memory Systems
We characterize the complexity of liveness verification for parameterized systems consisting of a leader process and arbitrarily many anonymous and identical contributor processes. Processes communicate through a shared, bounded-value register. While each operation on the register is atomic, there is no synchronization primitive to execute a sequence of operations atomically. We analyze the cas...
متن کاملOn parametrized verification of asynchronous, shared-memory pushdown systems
We consider the model of parametrized asynchronous shared-memorypushdown systems as introduced in [Hague’11]. In a series of recentpapers it has been shown that reachability in this model is Pspace-complete [Esparza, Ganty, Majumdar’13] and that liveness is decidablein Nexptime [Durand-Gasselin, Esparza, Ganty, Majumdar’15]. Weshow that the liveness problem is Pspace-complet...
متن کاملOn the verification of asynchronous parameterized networks
The uniform verification problem for parameterized systems is to determine whether a temporal property is true for every instance of the system which is composed of an arbitrary number of homogeneous processes. We consider some aspects of the inductionbased technique which assumes the construction of finite invariants of such systems. An invariant process is one which is greater (with respect t...
متن کاملComputing in Totally Anonymous Asynchronous Shared Memory Systems
In the totally anonymous shared memory model of asynchronous distributed computing, processes have no id's and run identical programs. Moreover, processes have identical interface to the shared memory, and in particular, there are no single-writer registers. This paper assumes that processes do not fail, and the shared memory consists only of read/write registers, which are initialized to some ...
متن کاملProactive Leader Election in Asynchronous Shared Memory Systems
In this paper, we give an algorithm for fault-tolerant proactive leader election in asynchronous shared memory systems, and later its formal verification. Roughly speaking, a leader election algorithm is proactive if it can tolerate failure of nodes even after a leader is elected, and (stable) leader election happens periodically. This is needed in systems where a leader is required after every...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2016
ISSN: 0004-5411,1557-735X
DOI: 10.1145/2842603